Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(s(X),X) |
→ f(X,a(X)) |
| 2: |
|
f(X,c(X)) |
→ f(s(X),X) |
| 3: |
|
f(X,X) |
→ c(X) |
|
There are 2 dependency pairs:
|
| 4: |
|
F(s(X),X) |
→ F(X,a(X)) |
| 5: |
|
F(X,c(X)) |
→ F(s(X),X) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006